A Matrix-Free Posterior Ensemble Kalman Filter Implementation Based on a Modified Cholesky Decomposition
نویسنده
چکیده
In this paper, a matrix-free posterior ensemble Kalman filter implementation based on a modified Cholesky decomposition is proposed. The method works as follows: the precision matrix of the background error distribution is estimated based on a modified Cholesky decomposition. The resulting estimator can be expressed in terms of Cholesky factors which can be updated based on a series of rank-one matrices in order to approximate the precision matrix of the analysis distribution. By using this matrix, the posterior ensemble can be built by either sampling from the posterior distribution or using synthetic observations. Furthermore, the computational effort of the proposed method is linear with regard to the model dimension and the number of observed components from the model domain. Experimental tests are performed making use of the Lorenz-96 model. The results reveal that, the accuracy of the proposed implementation in terms of root-mean-square-error is similar, and in some cases better, to that of a well-known ensemble Kalman filter (EnKF) implementation: the local ensemble transform Kalman filter. In addition, the results are comparable to those obtained by the EnKF with large ensemble sizes.
منابع مشابه
A Parallel Implementation of the Ensemble Kalman Filter Based on Modified Cholesky Decomposition
This paper discusses an efficient parallel implementation of the ensemble Kalman filter based on the modified Cholesky decomposition. The proposed implementation starts with decomposing the domain into sub-domains. In each sub-domain a sparse estimation of the inverse background error covariance matrix is computed via a modified Cholesky decomposition; the estimates are computed concurrently on
متن کاملAn Ensemble Kalman Filter Implementation Based on 1 Modified Cholesky Decomposition for Inverse
This paper develops an efficient implementation of the ensemble Kalman filter based 5 on a modified Cholesky decomposition for inverse covariance matrix estimation. This implementation 6 is named EnKF-MC. Background errors corresponding to distant model components with respect 7 to some radius of influence are assumed to be conditionally independent. This allows to obtain 8 sparse estimators of...
متن کاملEfficient Implementation of the Ensemble Kalman Filter
We present several methods for the efficient implementation of the Ensemble Kalman Filter (EnKF) of Evensen. It is shown that the EnKF can be implemented without access to the observation matrix, and only an observation function is needed; this greatly simplifies software design. New implementations of the EnKF formulas are proposed, with linear computational complexity in the number of data po...
متن کاملEnsemble propagation and continuous matrix factorization algorithms
We consider the problem of propagating an ensemble of solutions and its characterization in terms of its mean and covariance matrix. We propose differential equations that lead to a continuous matrix factorization of the ensemble into a generalized singular value decomposition (SVD). The continuous factorization is applied to ensemble propagation under periodic rescaling (ensemble breeding) and...
متن کاملRapid Ambiguity Resolution for Single Frequency GPS Kinematical Positioning Based on Left Null Space Theory
According to the dynamic GPS rapid positioning ambiguity resolution problems, a modified algorithm for rapid integer ambiguity resolution is proposed. Firstly, a method of QR decomposition is applied on the observation matrix to construct the left null space matrix in order to construct the left null space matrix, so as to decrease dimensions of the matrix and to satisfy rapid ambiguity resolut...
متن کامل